Implementing 64-bit Maximally Equidistributed Mersenne Twisters

نویسندگان

  • Shin Harase
  • Takamitsu Kimoto
چکیده

In this appendix, we examine the 64-bit integer output sequences of the SFMT19937 generator (or the double-precision floating-point numbers in [0, 1) converted from them). In fact, the SFMT generators are optimized under the assumption that one will mainly be using 32-bit output sequences, so that the dimensions of equidistribution with v-bit accuracy for 64-bit output sequences are worse than those for 32-bit cases. We therefore study the structure of SFMT19937 and point out its weaknesses. We also apply empirical statistical tests to non-successive values of SFMT19937 and find that the generator fails them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Appendix to: Implementing 64-bit Maximally Equidistributed F2-Linear Generators with Mersenne Prime Period

In this appendix, we examine the 64-bit integer output sequences of the SFMT19937 generator (or the double-precision floating-point numbers in [0, 1) converted from them). In fact, the SFMT generators are optimized under the assumption that one will mainly be using 32-bit output sequences, so that the dimensions of equidistribution with v-bit accuracy for 64-bit output sequences are worse than ...

متن کامل

A PRNG specialized in double precision floating point numbers using an affine transition

We propose a pseudorandom number generator specialized to generate double precision floating point numbers. It generates 52-bit pseudorandom patterns supplemented by a constant most significant 12 bits (sign and exponent), so that the concatenated 64 bits represents a floating point number obeying the IEEE 754 format. To keep the constant part, we adopt an affine transition function instead of ...

متن کامل

SIMD-oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator

Mersenne Twister (MT) is a widely-used fast pseudorandom number generator (PRNG) with a long period of 2 − 1, designed 10 years ago based on 32-bit operations. In this decade, CPUs for personal computers have acquired new features, such as Single Instruction Multiple Data (SIMD) operations (i.e., 128bit operations) and multi-stage pipelines. Here we propose a 128-bit based PRNG, named SIMD-orie...

متن کامل

Conversion of Mersenne Twister to double-precision floating-point numbers

The 32-bit Mersenne Twister generator MT19937 is a widely used random number generator. To generate numbers with more than 32 bits in bit length, and particularly when converting into 53-bit double-precision floating-point numbers in [0, 1) in the IEEE 754 format, the typical implementation concatenates two successive 32-bit integers and divides them by a power of 2. In this case, the 32-bit MT...

متن کامل

34.1. Sampling the Uniform Distribution 34.2. Inverse Transform Method

Monte Carlo techniques are often the only practical way to evaluate difficult integrals or to sample random variables governed by complicated probability density functions. Here we describe an assortment of methods for sampling some commonly occurring probability density functions. Most Monte Carlo sampling or integration techniques assume a " random number generator, " which generates uniform ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1505.06582  شماره 

صفحات  -

تاریخ انتشار 2015